Open Default Theories over Closed Domains
نویسنده
چکیده
In this paper we compare two approaches to the meaning of a free variable x in an open default α(x) : β1(x), . . . , βm(x) γ(x) . The first treats x as a metavariable for the ground terms of the underlying theory, whereas the second treats it as a “name” of arbitrary elements of the theory universe. We show that, for normal default theories, under the domain closure assumption, the two approaches are equivalent. In the general case, the approaches are equivalent in the presence of both the domain closure assumption and the unique name assumption.
منابع مشابه
First-Order Default Logic
We propose a model theory for full first-order default logic that allows both closed and non-closed default theories. Beginning with first-order languages without logical equality, we note how Henkin’s proof of the completeness theorem for first-order logic yields complete algebras; that is, algebras over which models of consistent theories may always be found. The uniformity is what is interes...
متن کاملDefaults in Domain Theory Defaults in Domain Theory
This paper uses ideas from artiicial intelligence to show how default notions can be deened over Scott domains. We combine these ideas with ideas arising in domain theory to shed some light on the properties of nonmonotonicity in a general model-theoretic setting. We consider in particular a notion of default nonmonotonic entailment between prime open sets in the Scott topology of a domain. We ...
متن کاملDefaults in Domain Theory
This paper uses ideas from artiicial intelligence to show how default notions can be deened over Scott domains. We combine these ideas with ideas arising in domain theory to shed some light on the properties of nonmonotonicity in a general model-theoretic setting. We consider in particular a notion of default nonmonotonic entailment between prime open sets in the Scott topology of a domain. We ...
متن کاملMore on modal aspects of default logic
Investigations of default logic have been so far mostly concerned with the notion of an extension of a default theory. It turns out, however, that default logic is much richer. Namely, there are other natural classes of objects that might be associated with default reasoning. We study two such classes of objects with emphasis on their relations with modal nonmonotonic formalisms. First, we intr...
متن کاملAny-world assumptions in logic programming
Due to the usual incompleteness of information representation, any approach to assign a semantics to logic programs has to rely on a default assumption on the missing information. The stable model semantics, that has become the dominating approach to give semantics to logic programs, relies on the Closed World Assumption (CWA), which asserts that by default the truth of an atom is false. There ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logic Journal of the IGPL
دوره 7 شماره
صفحات -
تاریخ انتشار 1999